Classifying a family of symmetric graphs
نویسندگان
چکیده
منابع مشابه
Classifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملClassifying a Family of Symmetric Graphs
Let Γ be a G-symmetric graph admitting a nontrivial G-invariant partition B of block size v. For blocks B,C of B adjacent in the quotient graph ΓB, let k be the number of vertices in B adjacent to at least one vertex in C. In this paper we classify all possibilities for (Γ,ΓB, G) in the case where k = v − 1 ≥ 2 and B(α) = B(β) for adjacent vertices α, β of Γ, where for a vertex of Γ, say γ ∈ B,...
متن کاملClassifying cubic symmetric graphs of order 8p or 8p2
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, we classify the s-regular elementary Abelian coverings of the three-dimensional hypercube for each s ≥ 1 whose fibre-preserving automorphism subgroups act arc-transitively. This gives a new infinite family of cubic 1-regular graphs, in which the smallest one has order 19 208. As an application...
متن کاملA Family of Symmetric Graphs with Complete Quotients
A finite graph Γ is G-symmetric if it admits G as a group of automorphisms acting transitively on V (Γ) and transitively on the set of ordered pairs of adjacent vertices of Γ. If V (Γ) admits a nontrivial G-invariant partition B such that for blocks B,C ∈ B adjacent in the quotient graph ΓB relative to B, exactly one vertex of B has no neighbour in C, then we say that Γ is an almost multicover ...
متن کاملUnitary graphs and classification of a family of symmetric graphs with complete quotients
A finite graph Γ is called G-symmetric if G is a group of automorphisms of Γ which is transitive on the set of ordered pairs of adjacent vertices of Γ. We study a family of symmetric graphs, called the unitary graphs, whose vertices are flags of the Hermitian unital and whose adjacency relations are determined by certain elements of the underlying finite fields. Such graphs admit the unitary gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2001
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700019377